Technical Report - Randomized
نویسنده
چکیده
| We describe an algorithm for the detection of ellipse shapes in images, using the Randomized Hough Transform. The algorithm is compared to a standard implementation of the Hough Transform, and the Probabilistic Hough Transform. Tests are performed using both noise-free and noisy images, and several real-world images. The algorithm was found to give improvements in accuracy, and a reduction in computation time, memory requirements and the number of false alarms detected.
منابع مشابه
Technical report—Diagnosis and management of an initial UTI in febrile infants and young children.
OBJECTIVES The diagnosis and management of urinary tract infections (UTIs) in young children are clinically challenging. This report was developed to inform the revised, evidence-based, clinical guideline regarding the diagnosis and management of initial UTIs in febrile infants and young children, 2 to 24 months of age, from the American Academy of Pediatrics Subcommittee on Urinary Tract Infec...
متن کاملRandomized Algorithms For Packet Routing on the Mesh
Packet routing is an important problem of parallel computing since a fast algorithm for packet routing will imply 1) fast inter-processor communication, and 2) fast algorithms for emulating ideal models like PRAMs on fixed connection machines.There are three different models of packet routing, namely 1) Store and forward, 2) Multipacket, and 3) Cut through. In this paper we provide a survey of ...
متن کاملOptimal Randomized Algorithms for Multipacket and Wormhole Routing on the Mesh
In this paper, we present a randomized algorithm for the multipacket (i.e., k k) routing problem on an n x n mesh. The algorithm competes with high probability in at most kn + O(k log n) parallel communication steps, with a constant queue size of O(k). The previous best known algorithm [4] takes [5/4] kn + O([kn/f(n)]) steps with a queue size of O(k f(n)) (for any 1 ≤ f (n) ≤ n). We will also p...
متن کاملRandomized Parallel Selection
We show that selection on an input of size N can be performed on a P-node hypercube (P = N/(log N)) in time O(n/P) with high probability, provided each node can process all the incident edges in one unit of time (this model is called the parallel model and has been assumed by previous researchers (e.g.,[17])). This result is important in view of a lower bound of Plaxton that implies selection t...
متن کامل